Adding resolution to the DPLL procedure for Boolean satisfiability

We study the tradeoff between inference and search in the Davis Putnam algorithm. We show that neighbour resolution, a restricted form of resolution applied during search, can be simulated by applying binary resolution before search. We compare experimentally the cost of the two different methods. Our results demonstrate that binary resolution during preprocessing is generally effective at reducing both the size of the search tree and the total search time.